منابع مشابه
Subsequences of Standard Special Circular Sequences in E 2 T
properly defines a special polygon. We are interested in a part of such a sequence. It is shown that if the first point and the last point of the subsequence are different, it becomes a special polygonal sequence. The concept of „a part of” is introduced, and the subsequence having this property can be characterized by using „mid” function. For such subsequences, the concepts of „Upper” and „Lo...
متن کاملHeapable Sequences and Subsequences
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a previously placed number. In this paper we consider a variety of problems related to heapable sequences and subsequences that do not appear to have been studied previously. Our motivation for introducing these conc...
متن کاملDetecting Linear Sequences and Subsequences†
Greenwood (1946), using an L2 distance, and others have addressed the question of detecting a too-linear fit of the occurrence times T0 < T1 < · · · < Tn of a sequence of random events. Two convenient distances are introduced here, then applied to the more challenging problem of detecting too-linear subsequences, where the multiple subsequence effect must be taken into account. Two interpretati...
متن کاملCONVERGENT SUBSEQUENCES FROM SEQUENCES OF FUNCTIONS ( i )
Let \yA be a sequence of functions, y. e TlseSE where S is a nonempty subset of the /-dimensional Euclidean space and 77 is an ordered vector space with positive cone X . If y, £"sfji,i sufficient conditions are given that \y A have a subsequence \hA such that for each t e S the sequence {A.(i)| is monotone for k sufficiendy large, depending on i. If each E is an ordered topological vector spac...
متن کاملCounting Nondecreasing Integer Sequences that Lie Below a Barrier
Given a barrier 0 ≤ b0 ≤ b1 ≤ · · · , let f(n) be the number of nondecreasing integer sequences 0 ≤ a0 ≤ a1 ≤ · · · ≤ an for which aj ≤ bj for all 0 ≤ j ≤ n. Known formulæ for f(n) include an n × n determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of bj = rj + s, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90036-h